Uncertainty quantification and reduction using Jacobian and Hessian information
نویسندگان
چکیده
Abstract Robust design methods have expanded from experimental techniques to include sampling methods, sensitivity analysis and probabilistic optimisation. Such typically require many evaluations. We study noise variable cross-term second derivatives of a response quickly identify variables that reduce variability. first compute the uncertainty variance decomposition determine contributing an initial design. Then we Hessian second-derivative matrix cross-terms between variance-contributing proposed change variables. Design with large terms are those can relate coefficients reduction in Sobol indices change. Next, derivative Jacobian indicate which shift mean maintain desired nominal target value. Thereby, changes be variability while maintaining targeted This workflow finds improve robustness minimal four runs per also explore further computation reductions achieved through compounding An example is shown on Stirling engine where top tolerances identified 16 generated 20% less variance.
منابع مشابه
Uncertainty Quantification for LDDMM Using a Low-Rank Hessian Approximation
This paper presents an approach to estimate the uncertainty of registration parameters for the large displacement diffeomorphic metric mapping (LDDMM) registration framework. Assuming a local multivariate Gaussian distribution as an approximation for the registration energy at the optimal registration parameters, we propose a method to approximate the covariance matrix as the inverse of the Hes...
متن کاملHessian Nilpotent Polynomials and the Jacobian Conjecture
Let z = (z1, · · · , zn) and ∆ = ∑n i=1 ∂ 2 ∂z i the Laplace operator. The main goal of the paper is to show that the wellknown Jacobian conjecture without any additional conditions is equivalent to the following what we call vanishing conjecture: for any homogeneous polynomial P (z) of degree d = 4, if ∆P(z) = 0 for all m ≥ 1, then ∆P(z) = 0 when m >> 0, or equivalently, ∆P(z) = 0 when m > 3 2...
متن کاملForward and Backward Uncertainty Quantification in Optimization
This contribution gathers some of the ingredients presented during the Iranian Operational Research community gathering in Babolsar in 2019.It is a collection of several previous publications on how to set up an uncertainty quantification (UQ) cascade with ingredients of growing computational complexity for both forward and reverse uncertainty propagation.
متن کاملComputing sparse Hessian and Jacobian approximations with optimal hereditary properties
In nonlinear optimization it is often important to estimate large sparse Hessian or Jacobian matrices, to be used for example in a trust region method. We propose an algorithm for computing a matrix B with a given sparsity pattern from a bundle of the m most recent diierence vectors = h k?m+1 : : : k i ; ? = h k?m+1 : : : k i ; where B should approximately map into ?. In this paper B is chosen ...
متن کاملsynthesis of amido alkylnaphthols using nano-magnetic particles and surfactants
we used dbsa and nano-magnetic for the synthesis of amido alkylnaphtols.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Design science
سال: 2021
ISSN: ['2053-4701']
DOI: https://doi.org/10.1017/dsj.2021.20